Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity

We consider a typed lambda-calculus with no function types, only alternating sum and product types, so that closed terms represent strategies. We add nondeterminism and consider strategies up to lower (i.e. divergence-insensitive) bisimilarity. We investigate the question: when is a function on strategies definable by an open term (with sufficiently large nondeterminism)? The answer is: when it...

متن کامل

Characterizing Recursive Programs up to Bisimilarity

A recursive program is determined, up to bisimilarity, by the operation of the recursion body on arbitrary processes, of which it is a fixpoint. The traditional proof of this fact uses Howe’s method, but that does not tell us how the fixpoint is obtained. In this paper, we show that the fixpoint may be obtained by a least fixpoint procedure iterated through the hierarchy of countable ordinals, ...

متن کامل

Some problems related to bisimilarity on BPP

Jančar has in 2003 shown that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space. Bisimilarity is studied on various subclasses of BPP as well. We present summary of known complexity bounds of some such bisimilarity problems. Moreover is here shown that deciding regularity of a BPP is PSPACE-complete. So far this problem was only known to be PSPACE-hard.

متن کامل

On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations

It is shown how certain refutation methods can be extended into semi-decision procedures that are complete for both unsatisfiability and finite satisfiability. The proposed extension is justified by a new characterization of finite satisfiability. This research was motivated by a database design problem: Deduction rules and integrity constraints in definite databases have to be finitely satisfi...

متن کامل

A lower estimate of harmonic functions

We shall give a lower estimate of harmonic‎ ‎functions of order greater than one in a half space‎, ‎which‎ ‎generalize the result obtained by B‎. ‎Ya‎. ‎Levin in a half plane‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2009

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2009.07.098